A Binary Tree is similar to an array, list, but it's more of a hierarchical data structure... So instead of a list which is made up like this:
Code:
Item 1
Item 2
Item 3
Etc.
The Binary Tree will look like this:
Code:
Item
|....item 1
. |....item 1.1
|....item 2
. |....item 2.1
|....item 3
. |....item 3.1
Edit: Damn it, the formatting messed up when I hit submit. It's supposed to show the ".1" items branching out from "1", "2", "3". And those ones branching out from "item", like a tree. And the last elements are called leaves.
I got lazy doing this on my phone, could have added more elements but you get the idea... It's basically a tree. Sometimes it'll be needed for you to break down your data into categories like this instead of having one list. I think if you google or YouTube, you'll get a better explanation. Typically this makes data easier to search and manipulate.
Hashing is also pretty simple to understand. It's similar to the list above, except what if this list was massive and you didn't know all of the item names? You could use an ID, call the ID an index number, or key, which will point to the item name in the list. Google this too as it doesn't take a lot of reading.
Sent from my iPhone using Tapatalk