Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
how stack operation proves costly during traversing a tree
#1
Stack data structure is useful when a single function call again and again and its performance decreases when a function calls another function like function F is calling function G. It will take time to put the values in the stack. If you create your own stack, it takes time for creation and then push and pop will also consume time.

0300-9520262
Get solution in 24 hour
|cpmputer & internetConfusedmileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  What is difference among Binary Tree, Complete Binary Tree and Binary Search Tree? Vuhelper 2 4,343 03-18-2012, 12:47 AM
Last Post: Xpert
  Threaded Binary Tree? in C++ 2012 Vuhelper 0 3,474 01-06-2012, 12:25 AM
Last Post: Vuhelper
  why huffman tree is not an AVL tree not how? Vuhelper 0 2,040 01-04-2012, 10:39 PM
Last Post: Vuhelper
  why Hoffman tree is not an AVL Tree? Vuhelper 0 2,123 01-04-2012, 10:33 PM
Last Post: Vuhelper
  AVL tree, It must satisfie the 2 conditions. Vuhelper 0 811 01-04-2012, 10:32 PM
Last Post: Vuhelper
  how to insert a new node on AVL tree using double rotation? Vuhelper 0 2,677 01-04-2012, 10:31 PM
Last Post: Vuhelper
  the method of balancing an anl tree? Vuhelper 0 2,983 01-04-2012, 10:30 PM
Last Post: Vuhelper
  Balance of the AVL tree im Data structure 2012 Vuhelper 0 1,901 01-04-2012, 10:27 PM
Last Post: Vuhelper
  depth of binary search tree d=log2(n+1) - 1 if n = 1000000 how answer is 20 Vuhelper 0 2,332 01-04-2012, 10:25 PM
Last Post: Vuhelper
  the uses of queues and stacks? the application of binery tree? in C++ 2012 Vuhelper 0 1,682 01-04-2012, 10:24 PM
Last Post: Vuhelper

Forum Jump:


Users browsing this thread: 1 Guest(s)