Continuing on the quick revision of important questions for my Interviews. These are good puzzles or questions related to Data Structures. (All are in Java)
Reverse a Linked List
Circular Linked List
Dijkstra's Algorithm
Self-Balancing Tree
Enjoy!
~ Core Java, Java EE, Algorithms, Data Structures, Problem Solving, IQ, Puzzles, Design Patterns, Software Architecture! ~
I Hereby Post My Version Of The Inorder, Preorder And Postorder Code In C++. Please Provide Your Valuable Feedback Or Additions To The Code.
I Am Also Providing A Simple Explanation Here Along
With The Download For An Explanation Of How To Perform These Simple Tree
Traversals. Please Provide Your Comments On The Documentation As Well.
In A Binary Search Tree, Every Node Has The Left Subtree With Elements
Lesser Than Itself And The Right Subtree Withe Elements Greater Than (Or Equal)
To Itself. In A BST, The Tree Can Be Traversed Using The Following Mechanisms.