March 2019
Intermediate to advanced
336 pages
9h 9m
English
This chapter covered the contains, put, remove, find, reset, NumberOfElements, getKeys, and getValues methods of the dictionary data structure. The InsertTreeNode, Delete, Search, and stringify TreeSet operations have been explained in detail, and code examples were provided. The BinarySearchTree structure has been presented in code, along with the InsertElement, InOrderTraversal, PreOrderTraverseTree, SearchNode, and RemoveNode functions.
The next chapter covers algorithms such as sorting, searching, recursion, and hashing.
Read now
Unlock full access