J48 algorithm in weka algorithm or flowchart steps

I am new in the machine learning area. please, I was wondering if you could provide me with algorithm or flowchart steps for J48. note: I am using the default setting in weka. thank you for your help.

Solution

J48 is based on Quinlan's C4.5.

Big Number Subtraction in C
If the n-body problem is chaotic, why isn't it used as a RNG?
Using BFS for Weighted Graphs
Removing a node in an undirected graph that destroys a path between two other nodes
Binary search function is correct but it returns undefined
Algorithm to reverse an array/string only in terms of rotate operations
Correctness of Deletion algorithm of BST in CLRS
Time Complexities n(log(n)) and log(n^n)
How do I find the closest possible sum of an array's elements to a particular value?
Split on regex (more than a character, maybe variable width) and keep the separator like GNU awk
Find the minimum number of edits to balance parentheses?
How to improve pandas DF processing time on different combinations of calculated data
Efficiently calculate an availability date from a list of project assignments and known capacity
Optimized algorithm to schedule tasks with dependency?
Difference between back tracking and dynamic programming
Javascript data structures library
Segmentation error when implementing the Hoare quick sort method
Which of these implementations is canonical: storing the head and size variables, or storing the head, tail, and size?
Visualization of calendar events. Algorithm to layout events with maximum width
Tracing edges of pixels in a mask
Longest Subarray with Maximum Bitwise AND
Assigning codes to nodes such that codes are unique and create two groups which share common properties
Randomly Split a Graph into Mini Graphs
Recursion relation and overlapping sub problems
Calculating the 90th percentile in O(n) time
Return a new string that sorts between two given strings
Is it possible to divide points to regions only based on their minimum distance to region-dividing curves?
How can I find a number in a list (smaller than a given bound but the biggest one)?
Balanced Partition greedy approach
Algorithm for minimizing (s[i]-s[j]+d)/(i-j)