In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.
A. Threaded binary trees
B. AVL Tree
C. B+ tree
D. Heap
Answer:C
In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.
A. Threaded binary trees B. AVL Tree C. B+ tree D. Heap